Complex correspondences in straight line stereo matching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Searching Correspondences in Colour Stereo

| We introduce an approach for obtaining dense contour maps of objects, which is based on the combination of the images of two or more colour cameras. As with all stereo techniques corresponding points in the image planes of the cameras, i. e. pixels illuminated by a certain point on the object, must be identiied before the distance between the cameras and the object point is computed by triang...

متن کامل

Multiresolution stereo image matching using complex wavelets

This paper describes a multiresolution image-matching strategy, based on the Complex Discrete Wavelet Transform (CDWT), to derive a dense disparity field with hierarchical (coarse-to-fine) refinement. The CDWT feature space efficiently provides fractionally accurate matching results which are robust to typical image formation perturbations such as offsets, global scaling, and additive noise. At...

متن کامل

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs

We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its variant. The length of the text T and pattern P may grow exponentially with respect to its description size n and m, respectively. The best known algorithm for the problem runs in O(nm) time using O(nm) space. In this paper...

متن کامل

A Pattern-based Ontology Matching Approach for Detecting Complex Correspondences

State of the art ontology matching techniques are limited to detect simple correspondences between atomic concepts and properties. Nevertheless, for many concepts and properties atomic counterparts will not exist, while it is possible to construct equivalent complex concept and property descriptions. We define a correspondence where at least one of the linked entities is non-atomic as complex c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geo-spatial Information Science

سال: 2010

ISSN: 1009-5020,1993-5153

DOI: 10.1007/s11806-010-0256-3